T

G

C

T

T

G

C

T

-

0

1

2

3

4

T

1

0

1

2

D

H

H

G

2

G

3

C

4

T

5

7.5 shows the full forward propagation alignment results for all

ng the Sellers algorithm. After all cells were filled by the

t distances, discovering the best alignment was implemented in a

d propagation process in this table.

able 7.5. The alignment result for all cells. V stands for vertical move.

0

1

2

3

4

1

2

3

4

-

T

G

C

T

T

G

C

T

-

0

1

2

3

4

T

1

0

1

2

3

D

H

H

H

G

2

1

0

1

2

V

D

H

H

G

3

2

1

1

2

V

D

D

H

C

4

3

2

1

2

V

V

D

H

T

5

4

3

2

1

D

V

V

D

he backward propagation stage

h in the backward propagation stage starts from the most bottom-

ner cell with the minimum alignment distance. If the alignment

of the most bottom-right cell is not the least, a search of the least

s backwards to the left cells or upwards to the upper cells. In this

s are inserted at the end of one sequence.

d on Table 7.5, the best route for the cell (5, 4) was the diagonal

m the cell (4, 3). The alignment distance of the cell (5, 4) was

ause the move for the cell (5, 4) was diagonal, the distance

sition is shown below, where the alignment distance in the cell

s one, i.e., d(GGCT, GCT)=1 and the current alignment in the cell

s 0, i.e., δ(T, T)=0.